Lab: Simulated Annealing (Optional)

An illustration of Simulated Annealing (*Source: [Wikimedia Commons](https://commons.wikimedia.org/wiki/File:Hill_Climbing_with_Simulated_Annealing.gif)*) — An illustration of Simulated Annealing (*Source: Wikimedia Commons*)

In this optional exercise you can check your understanding of simulated annealing by implementing the algorithm in a Jupyter notebook and using it to solve the Traveling Salesman Problem (TSP) between US state capitals.

To get started, clone this GitHub repo: https://github.com/udacity/AIND-Simulated_Annealing
Then open AIND-Simulated_Annealing.ipynb:
python jupyter notebook AIND-Simulated_Annealing.ipynb
Follow the instructions to implement Simulated Annealing from AIMA in the notebook and complete the lab.
If you're stuck or would like to discuss your approach, hop onto the forums.

Once you're done, there's no need to submit (this is not a reviewed project), but feel free to share your results with others.

Good luck!